Probabilistic Acceptance
نویسنده
چکیده
The idea of fully accepting statements when the evidence has rendered them probable enough faces a number of difficulties. We leave the interpretation of probability largely open, but attempt to suggest a contextual ap proach to full belief. We show that the dif ficulties of probabilistic acceptance are not as severe as they are sometimes painted, and that though there are oddities associ ated with probabilistic acceptance they are in some instances less awkward than the dif ficulties associated with other nonmonotonic formalisms. We show that the structure at which we arrive provides a natural home for statistical inference.
منابع مشابه
Using Probabilistic-Risky Programming Models in Identifying Optimized Pattern of Cultivation under Risk Conditions (Case Study: Shoshtar Region)
Using Telser and Kataoka models of probabilistic-risky mathematical programming, the present research is to determine the optimized pattern of cultivating the agricultural products of Shoshtar region under risky conditions. In order to consider the risk in the mentioned models, time period of agricultural years 1996-1997 till 2004-2005 was taken into account. Results from Telser and Kataoka mod...
متن کاملA method to calculate the acceptance probability and risk of rejection of bid prices on the electricity market
After restructuring, Iran’s electricity market has become one of the most competitive markets in which generation companies offer their proposed price on several price benches. So, the decisions in this market can use statistical concepts. In this paper, a conceptual model is presented according to simultaneous analysis of probabilistic distribution for historical data of market clearing price ...
متن کاملDenotational Semantics for Probabilistic Refusal Testing
In this paper, refusal testing ideas are applied to deene a testing semantics for a probabilistic process algebra. A testing equivalence is deened by combining the greater discriminatory power of refusal testing and a simple treatment of the prob-abilistic component of processes. This testing equivalence is characterized by two fully abstract denotational semantics. The rst of them is based on ...
متن کاملA Probabilistic Kleene Theorem
We provide a Kleene Theorem for (Rabin) probabilistic automata over finite words. Probabilistic automata generalize deterministic finite automata and assign to a word an acceptance probability. We provide probabilistic expressions with probabilistic choice, guarded choice, concatenation, and a star operator. We prove that probabilistic expressions and probabilistic automata are expressively equ...
متن کاملAn Enhanced Artificial Bee Colony Algorithm with Solution Acceptance Rule and Probabilistic Multisearch
The artificial bee colony (ABC) algorithm is a popular swarm based technique, which is inspired from the intelligent foraging behavior of honeybee swarms. This paper proposes a new variant of ABC algorithm, namely, enhanced ABC with solution acceptance rule and probabilistic multisearch (ABC-SA) to address global optimization problems. A new solution acceptance rule is proposed where, instead o...
متن کامل